An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks

The paper deals with the problem of simultaneously assignment of server’s allocation, channel capacities and flow routes in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Some interesting features, observed during the computational experiments are reported.